home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Aminet 52
/
Aminet 52 (2002)(GTI - Schatztruhe)[!][Dec 2002].iso
/
Aminet
/
game
/
think
/
AmiChess.lha
/
AmiChess
/
src
/
common.h
< prev
next >
Wrap
C/C++ Source or Header
|
2002-10-13
|
16KB
|
644 lines
#ifndef COMMON_H
#define COMMON_H
#include "config.h"
typedef unsigned long long BitBoard;
typedef unsigned long long HashType;
typedef unsigned long KeyType;
typedef struct
{
BitBoard b[2][7];
BitBoard friends[2];
BitBoard blocker;
BitBoard blockerr90;
BitBoard blockerr45;
BitBoard blockerr315;
short ep;
short flag;
short side;
short material[2];
short pmaterial[2];
short castled[2];
short king[2];
} Board;
typedef struct
{
int move;
int score;
} leaf;
typedef struct
{
int move;
short epsq;
short bflag;
short Game50;
short mvboard;
float et;
HashType hashkey;
HashType phashkey;
char SANmv[8];
} GameRec;
typedef struct
{
KeyType key;
int move;
int score;
short flag;
short depth;
} HashSlot;
typedef struct
{
KeyType pkey;
BitBoard passed;
BitBoard weaked;
short score;
short phase;
} PawnSlot;
/* MACRO definitions */
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define SET(a,b) (a|=b)
#define CLEAR(a,b) (a&=~b)
#define DRAWSCORE (computerplays==board.side?(opprating-myrating)/4:(myrating-opprating)/4)
#define MATERIAL (board.material[side]-board.material[1^side])
#define PHASE (8-(board.material[white]+board.material[black])/1150)
#define KEY(a) (a>>32)
/* Attack MACROS */
#define BishopAttack(sq) (Bishop45Atak[sq][(board.blockerr45>>Shift45[sq])&Mask45[sq]]|Bishop315Atak[sq][(board.blockerr315>>Shift315[sq])&Mask315[sq]])
#define RookAttack(sq) (Rook00Atak[sq][(board.blocker>>Shift00[sq])&0xFF]|Rook90Atak[sq][(board.blockerr90>>Shift90[sq])&0xFF])
#define QueenAttack(sq) (BishopAttack(sq)|RookAttack(sq))
/* Some bit macros */
/*
* gcc 2.95.4 completely screws up the macros with lookup tables
* with -O2 on PPC,maybe this check has to be refined.(I don't know
* whether other architectures also suffer from this gcc bug.) However,
* with gcc 3.0,the lookup tables are _much_ faster than this direct
* calculation.
*/
#if defined(__GNUC__) && defined(__PPC__) && __GNUC__ < 3
#define SETBIT(b,i) ((b)|=((1ULL<<63)>>(i)))
#define CLEARBIT(b,i) ((b)&=~((1ULL<<63)>>(i)))
#else
#define SETBIT(b,i) ((b)|=BitPosArray[i])
#define CLEARBIT(b,i) ((b)&=NotBitPosArray[i])
#endif
#define RANK(i) ((i)>>3)
#define ROW(i) ((i)&7)
#define trailz(b) (leadz((b)&((~b)+1)))
#define PROMOTEPIECE(a) ((a>>12)&0x0007)
#define CAPTUREPIECE(a) ((a>>15)&0x0007)
#define TOSQ(a) ((a)&0x003F)
#define FROMSQ(a) ((a>>6)&0x003F)
#define MOVE(a,b) (((a)<<6)|(b))
#define white 0
#define black 1
#define false 0
#define true 1
#define ks 0
#define qs 1
#define INFINITY 32767
#define MATE 32767
#define MATESCORE(a) ((a)>MATE-255||(a)<-MATE+255)
/* constants for Board */
#define WKINGCASTLE 0x0001
#define WQUEENCASTLE 0x0002
#define BKINGCASTLE 0x0004
#define BQUEENCASTLE 0x0008
#define WCASTLE (WKINGCASTLE|WQUEENCASTLE)
#define BCASTLE (BKINGCASTLE|BQUEENCASTLE)
/* Material values */
#define ValueP 100
#define ValueN 350
#define ValueB 350
#define ValueR 550
#define ValueQ 1100
#define ValueK 2000
/* constants for move description */
#define KNIGHTPRM 0x00002000
#define BISHOPPRM 0x00003000
#define ROOKPRM 0x00004000
#define QUEENPRM 0x00005000
#define PROMOTION 0x00007000
#define PAWNCAP 0x00008000
#define KNIGHTCAP 0x00010000
#define BISHOPCAP 0x00018000
#define ROOKCAP 0x00020000
#define QUEENCAP 0x00028000
#define CAPTURE 0x00038000
#define NULLMOVE 0x00100000
#define CASTLING 0x00200000
#define ENPASSANT 0x00400000
#define MOVEMASK (CASTLING|ENPASSANT|PROMOTION|0x0FFF)
/* Some special BitBoards */
#define NULLBITBOARD (0x0000000000000000ULL)
#define WHITESQUARES (0x55AA55AA55AA55AAULL)
#define BLACKSQUARES (0xAA55AA55AA55AA55ULL)
#define CENTRESQUARES (0x0000001818000000ULL)
#define COMPUTERHALF (0xFFFFFFFF00000000ULL)
#define OPPONENTHALF (0x00000000FFFFFFFFULL)
/* Game flags */
#define QUIT 0x0001
#define TESTT 0x0002
#define THINK 0x0004
#define MANUAL 0x0008
#define TIMEOUT 0x0010
#define DEBUGG 0x0020
#define ENDED 0x0040
#define USEHASH 0x0080
#define SOLVE 0x0100
#define USENULL 0x0200
#define TIMECTL 0x0800
#define POST 0x1000
#define AUTOPLAY 0x2000
#define SUPERVISOR 0x4000
#define REVERSEBOARD 0x8000
/* Node types */
#define PV 0
#define ALL 1
#define CUT 2
/* Transposition table flags */
#define EXACTSCORE 1
#define LOWERBOUND 2
#define UPPERBOUND 3
#define POORDRAFT 4
#define QUIESCENT 5
#define STICKY 8
/* Book modes */
#define BOOKOFF 0
#define BOOKRAND 1
#define BOOKBEST 2
#define BOOKWORST 3
#define BOOKPREFER 4
/* The various phases during move selection */
#define PICKHASH 1
#define PICKGEN1 2
#define PICKCAPT 3
#define PICKKILL1 4
#define PICKKILL2 5
#define PICKGEN2 6
#define PICKHIST 7
#define PICKREST 8
#define PICKCOUNTER 9
#define MAXTREEDEPTH 2000
#define MAXPLYDEPTH 65
#define MAXGAMEDEPTH 600
/*
Smaller HASHSLOT defaults 20011017 to improve blitz play
and make it easier to run on old machines
*/
#define HASHSLOTS 1024
#define PAWNSLOTS 512
#define DEPTH 12
extern short distance[64][64];
extern short taxicab[64][64];
extern unsigned char lzArray[65536];
extern short Shift00[64];
extern short Shift90[64];
extern short Shift45[64];
extern short Shift315[64];
extern BitBoard DistMap[64][8];
extern BitBoard BitPosArray[64];
extern BitBoard NotBitPosArray[64];
extern BitBoard MoveArray[8][64];
extern BitBoard Ray[64][8];
extern BitBoard FromToRay[64][64];
extern BitBoard RankBit[8];
extern BitBoard FileBit[8];
extern BitBoard Ataks[2][7];
extern BitBoard PassedPawnMask[2][64];
extern BitBoard IsolaniMask[8];
extern BitBoard SquarePawnMask[2][64];
extern BitBoard Rook00Atak[64][256];
extern BitBoard Rook90Atak[64][256];
extern BitBoard Bishop45Atak[64][256];
extern BitBoard Bishop315Atak[64][256];
extern BitBoard pinned;
extern BitBoard rings[4];
extern BitBoard stonewall[2];
extern BitBoard pieces[2];
extern BitBoard mask_kr_trapped_w[3];
extern BitBoard mask_kr_trapped_b[3];
extern BitBoard mask_qr_trapped_w[3];
extern BitBoard mask_qr_trapped_b[3];
extern BitBoard boardhalf[2];
extern BitBoard boardside[2];
extern short directions[64][64];
extern unsigned char BitCount[65536];
extern leaf Tree[MAXTREEDEPTH];
extern leaf *TreePtr[MAXPLYDEPTH];
extern int RootPV;
extern GameRec Game[MAXGAMEDEPTH];
extern short GameCnt;
extern short computer;
extern unsigned int flags;
extern Board board;
extern short cboard[64];
extern short Mvboard[64];
extern HashType hashcode[2][7][64];
extern HashType ephash[64];
extern HashType WKCastlehash;
extern HashType WQCastlehash;
extern HashType BKCastlehash;
extern HashType BQCastlehash;
extern HashType Sidehash;
extern HashType HashKey;
extern HashType PawnHashKey;
extern HashSlot *HashTab[2];
extern PawnSlot *PawnTab[2];
extern short Idepth;
extern short SxDec;
extern short Game50;
extern int lazyscore[2];
extern int maxposnscore[2];
extern int rootscore;
extern int lastrootscore;
extern unsigned long GenCnt;
extern unsigned long NodeCnt;
extern unsigned long QuiesCnt;
extern unsigned long EvalCnt;
extern unsigned long EvalCall;
extern unsigned long ChkExtCnt;
extern unsigned long OneRepCnt;
extern unsigned long RcpExtCnt;
extern unsigned long PawnExtCnt;
extern unsigned long HorzExtCnt;
extern unsigned long ThrtExtCnt;
extern unsigned long KingExtCnt;
extern unsigned long NullCutCnt;
extern unsigned long FutlCutCnt;
extern unsigned long RazrCutCnt;
extern unsigned long TotalGetHashCnt;
extern unsigned long GoodGetHashCnt;
extern unsigned long TotalPutHashCnt;
extern unsigned long CollHashCnt;
extern unsigned long TotalPawnHashCnt;
extern unsigned long GoodPawnHashCnt;
extern unsigned long RepeatCnt;
extern unsigned HashSize;
extern unsigned long TTHashMask;
extern unsigned long PHashMask;
extern short slider[8];
extern short Value[7];
extern char SANmv[10];
extern unsigned long history[2][4096];
extern int killer1[MAXPLYDEPTH];
extern int killer2[MAXPLYDEPTH];
extern short ChkCnt[MAXPLYDEPTH];
extern short ThrtCnt[MAXPLYDEPTH];
extern char id[32];
extern char solution[64];
/*
* XXX: This variable et also exists as a local variable somewhere and
* to complete the confusion,this came up in three different
* flavours: long,float and double.
*/
extern double et;
extern float SearchTime;
extern short SearchDepth;
extern short MoveLimit[2];
extern float TimeLimit[2];
extern short TCMove;
extern short TCinc;
extern float TCTime;
extern short hunged[2];
extern short phase;
extern int Hashmv[MAXPLYDEPTH];
extern short DebugPly;
extern short DebugDepth;
extern long DebugNode;
extern int Debugmv[MAXPLYDEPTH];
extern short Debugmvl;
extern short Debugline;
extern short RootPieces;
extern short RootPawns;
extern short RootMaterial;
extern short RootAlpha;
extern short RootBeta;
extern short pickphase[MAXPLYDEPTH];
extern short InChk[MAXPLYDEPTH];
extern short KingThrt[2][MAXPLYDEPTH];
extern short threatmv;
extern short threatply;
extern short KingSafety[2];
extern short pscore[64];
extern short bookmode;
extern short bookfirstlast;
extern short range[8];
extern short ptype[2];
extern char algbr[64][3];
extern char algbrfile[9];
extern char algbrrank[9];
extern char notation[8];
extern char lnotation[8];
extern short r90[64];
extern short r45[64];
extern short r315[64];
extern short Mask45[64];
extern short Mask315[64];
extern short myrating,opprating,suddendeath;
extern char name[50];
extern short computerplays;
extern short wasbookmove;
extern int nmovesfrombook;
extern float maxtime;
extern short n; /* Last mobility returned by CTL */
extern short ExchCnt[2];
extern int newpos,existpos; /* For book statistics */
extern short bookloaded;
enum Piece { empty,pawn,knight,bishop,rook,queen,king,bpawn };
enum Square {
A1,B1,C1,D1,E1,F1,G1,H1,
A2,B2,C2,D2,E2,F2,G2,H2,
A3,B3,C3,D3,E3,F3,G3,H3,
A4,B4,C4,D4,E4,F4,G4,H4,
A5,B5,C5,D5,E5,F5,G5,H5,
A6,B6,C6,D6,E6,F6,G6,H6,
A7,B7,C7,D7,E7,F7,G7,H7,
A8,B8,C8,D8,E8,F8,G8,H8
};
enum File { A_FILE,B_FILE,C_FILE,D_FILE,E_FILE,F_FILE,G_FILE,H_FILE };
/****************************************************************************
*
* The various function prototypes. They are group into the *.c files
* in which they are defined.
*
****************************************************************************/
/*
* Explanation of the #ifdef NO_INLINE conditionals:
*
* Define NO_INLINE only if you really must,implementations will be
* provided by the corresponding *.c files. The better solution is to
* not define it,in which case inlines.h will be included which
* provides static inline version of these functions.
*/
/* The initialization routines */
void Initialize();
void InitLzArray();
void InitBitPosArray();
void InitMoveArray();
void InitRay();
void InitFromToRay();
void InitRankFileBit();
void InitBitCount();
void InitPassedPawnMask();
void InitIsolaniMask();
void InitSquarePawnMask();
void InitRandomMasks();
void InitRotAtak();
void InitDistance();
void InitVars();
void InitHashCode();
void InitHashTable();
void NewPosition();
void InitFICS();
/* The book routines */
void MakeBinBook(char *,short);
int BookQuery();
int BookBuilderOpen();
int BookBuilder(short result,short side);
int BookBuilderClose();
/*
* Return values(errorcodes) for the book routines,
* maybe one should have a global enum of errorcodes
*/
enum {
BOOK_SUCCESS,
BOOK_EFORMAT,/* Wrong format(e.g. produced by older version) */
BOOK_EMIDGAME,/* Move is past the opening book's move limit */
BOOK_EIO,/* I/O error,e.g. caused by wrong permissions */
BOOK_EFULL,/* Book hash is full,new position was not added. */
BOOK_ENOBOOK,/* No book present */
BOOK_ENOMOVES,/* No moves found(in BookQuery() only) */
BOOK_ENOMEM /* Memory allocation failed */
};
/* The move generation routines */
void GenMoves(short);
void GenCaptures(short);
void GenNonCaptures(short);
void GenCheckEscapes(short);
void FilterIllegalMoves(short);
/* The move routines */
void MakeMove(short,int *);
void UnmakeMove(short,int *);
void MakeNullMove(short);
void UnmakeNullMove(short);
void SANMove(int,short);
leaf *ValidateMove(char *);
leaf *IsInMoveList(short,short,short,char);
short IsLegalMove(int);
char *AlgbrMove(int);
/* The attack routines */
short SqAtakd(short,short);
void GenAtaks();
BitBoard AttackTo(short,short);
BitBoard AttackXTo(short,short);
BitBoard AttackFrom(short,short,short);
BitBoard AttackXFrom(short,short);
short PinnedOnKing(short,short);
void FindPins(BitBoard *);
short MateScan(short);
/* The swap routines */
short SwapOff(int);
void AddXrayPiece(short,short,short,BitBoard *,BitBoard *);
/* The EPD routines */
short ReadEPDFile(const char *,short);
void ParseEPD(char *);
void LoadEPD(char *);
void SaveEPD(char *);
/* The command routines */
short InputCmd(char *);
void ShowCmd(char *);
void BookCmd(char *);
/* Some utility routines */
#ifdef NO_INLINE
unsigned char leadz(BitBoard);
unsigned char nbits(BitBoard);
#endif
void UpdateFriends();
void UpdateCBoard();
void UpdateMvboard();
void EndSearch(int);
short ValidateBoard();
/* PGN routines */
void PGNSaveToFile(const char *,const char *);
void PGNReadFromFile(const char *);
void BookPGNReadFromFile(const char *);
/* The hash routines */
void CalcHashKey();
void ShowHashKey(HashType);
/* The evaluation routines */
int ScoreP(short);
int ScoreN(short);
int ScoreB(short);
int ScoreR(short);
int ScoreQ(short);
int ScoreK(short);
int ScoreDev(short);
int Evaluate(int,int);
short EvaluateDraw();
/* Hung routines */
short EvalHung(short);
/* The search routines */
void Iterate();
int Search(short,short,int,int,short);
int SearchRoot(short,int,int);
int Quiesce(short,int,int);
void pick(leaf *,short);
short Repeat();
void ShowLine(int,int,char);
void GetElapsed();
/* The transposition table routies */
void TTPut(short,short,short,int,int,int,int);
short TTGet(short,short,short,int,int,int *,int *);
short TTGetPV(short,short,int,int *);
void TTClear();
void PTClear();
/* Sorting routines */
void SortCaptures(short);
void SortMoves(short);
void SortRoot();
short PhasePick(leaf **,short);
short PhasePick1(leaf **,short);
/* Some output routines */
void ShowMoveList(short);
void ShowSmallBoard();
void ShowBoard();
void ShowBitBoard(BitBoard *);
void ShowCBoard();
void ShowMvboard();
void ShowGame();
void ShowTime();
/* Random numbers routines */
unsigned int Rand32();
HashType Rand64();
/* Solver routines */
void Solve(char *);
/* Miscellaneous routines */
void ShowHelp(const char *);
/* Player database */
void DBSortPlayer(const char *style);
void DBListPlayer(const char *style);
void DBReadPlayer();
void DBWritePlayer();
int DBSearchPlayer(const char *player);
void DBUpdatePlayer(const char *player,const char *resultstr);
void DBTest();
#ifndef NO_INLINE
# include "inlines.h"
#endif
extern void *mui_app;
enum
{
MUIM_Chess_New=0x80660000,
MUIM_Chess_OpenEPD,
MUIM_Chess_OpenPGN,
MUIM_Chess_SaveEPD,
MUIM_Chess_SavePGN,
MUIM_Chess_Autoplay,
MUIM_Chess_SwapSides,
MUIM_Chess_SwitchSides,
MUIM_Chess_Hint,
MUIM_Chess_Undo,
MUIM_Chess_Remove,
MUIM_Chess_WinOpen,
MUIM_Chess_ShowBoard,
MUIM_Chess_Post,
MUIM_Chess_Depth,
MUIM_Chess_Time,
MUIM_Chess_ShowThinking,
MUIM_Chess_Supervisor,
MUIM_Chess_NullMove,
MUIM_Chess_BookAdd,
MUIM_Chess_BookOff,
MUIM_Chess_BookOn,
MUIM_Chess_BookBest,
MUIM_Chess_BookWorst,
MUIM_Chess_BookRandom,
MUIM_Chess_ReverseBoard,
MUIM_Chess_MyMove,
MUIM_Chess_Side,
MUIM_Chess_Skin,
MUIM_Chess_ClearFlag,
MUIM_Chess_AddMove,
MUIM_Chess_ClearList
};
struct MUIP_Chess_ShowThinking {unsigned long MethodID; char *line; };
struct MUIP_Chess_Post {unsigned long MethodID; int value; };
struct MUIP_Chess_NullMove {unsigned long MethodID; int value; };
struct MUIP_Chess_Supervisor {unsigned long MethodID; int value; };
struct MUIP_Chess_Depth {unsigned long MethodID; int depth; };
struct MUIP_Chess_Time { unsigned long MethodID; int flag; };
struct MUIP_Chess_ReverseBoard {unsigned long MethodID; int reverse; };
struct MUIP_Chess_Autoplay {unsigned long MethodID; int autoplay; };
struct MUIP_Chess_MyMove {unsigned long MethodID; char *move; };
struct MUIP_Chess_Skin { unsigned long MethodID; void *menu; };
struct MUIP_Chess_ClearFlag { unsigned long MethodID; int flag; };
struct MUIP_Chess_AddMove { unsigned long MethodID; int side; char *move; };
#endif